Simplicial trees are sequentially Cohen–Macaulay

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SEQUENTIALLY Sr SIMPLICIAL COMPLEXES AND SEQUENTIALLY S2 GRAPHS

We introduce sequentially Sr modules over a commutative graded ring and sequentially Sr simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying Serre’s condition Sr . In analogy with the sequentially CohenMacaulay property, we show that a simplicial complex is sequentially Sr if and only if its pure i-skeleton...

متن کامل

Simplicial and Cellular Trees

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed first by Bolker, Kalai and Adin, and more recently by numerous authors, the fundamental topological properties of a tree — namely acyclicity and connectedne...

متن کامل

Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexes

Björner and Wachs generalized the definition of shellability by dropping the assumption of purity; they also introduced the h-triangle, a doubly-indexed generalization of the h-vector which is combinatorially significant for nonpure shellable complexes. Stanley subsequently defined a nonpure simplicial complex to be sequentially Cohen-Macaulay if it satisfies algebraic conditions that generaliz...

متن کامل

Simplicial cycles and the computation of simplicial trees

We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree is a connected cycle-free simplicial complex, and use this characterization to produce an algorithm that checks in polynomial time whether a simplicial compl...

متن کامل

Optimal Decision Trees on Simplicial Complexes

We consider topological aspects of decision trees on simplicial complexes, concentrating on how to use decision trees as a tool in topological combinatorics. By Robin Forman’s discrete Morse theory, the number of evasive faces of a given dimension i with respect to a decision tree on a simplicial complex is greater than or equal to the ith reduced Betti number (over any field) of the complex. U...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2004

ISSN: 0022-4049

DOI: 10.1016/j.jpaa.2003.11.014